Intersections and supports of quadruple systems
نویسندگان
چکیده
منابع مشابه
Affine - invariant quadruple systems
Let t, v, k, λ be positive integers satisfying v > k > t. A t-(v, k, λ) design is an ordered pair (V,B), where V is a finite set of v points, B is a collection of k-subsets of V , say blocks, such that every t-subset of V occurs in exactly λ blocks in B. In what follows we simply write t-designs. A 3-(v, 4, 1) design is called a Steiner quadruple system and denoted by SQS(v). It is known that a...
متن کاملinvestigation of single-user and multi-user detection methods in mc-cdma systems and comparison of their performances
در این پایان نامه به بررسی روش های آشکارسازی در سیستم های mc-cdma می پردازیم. با توجه به ماهیت آشکارسازی در این سیستم ها، تکنیک های آشکارسازی را می توان به دو دسته ی اصلی تقسیم نمود: آشکارسازی سیگنال ارسالی یک کاربر مطلوب بدون در نظر گرفتن اطلاعاتی در مورد سایر کاربران تداخل کننده که از آن ها به عنوان آشکارساز های تک کاربره یاد می شود و همچنین آشکارسازی سیگنال ارسالی همه ی کاربران فعال موجود در...
On Quadruple Systems
( n — h\ 11 m — h\ I-hi I \l-hj is the number of those elements of S (I, m, n) which contain h fixed elements of E. It is known that condition (1) is not sufficient for S(l, m, n) to exist. It has been proved that no finite projective geometry exists with 7 points on every line. This implies non-existence of 5(2, 7, 43). There arises a problem of finding a necessary and sufficient condition for...
متن کاملQuadruple systems with independent neighborhoods
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max α { α ( n− α 3 ) + (n− α) ( α 3 )} = ( 1 2 + o(1) )( n 4 ) denote the maximum number of edges in an n-vertex odd 4-graph. Let n be sufficiently large, and let G be an n-vertex 4-graph such that for every triple xyz of vertices, the neighborhood ...
متن کاملCounting substructures III: quadruple systems
For various quadruple systems F , we give asymptotically sharp lower bounds on the number of copies of F in a quadruple system with a prescribed number of vertices and edges. Our results extend those of Füredi, Keevash, Pikhurko, Simonovits and Sudakov who proved under the same conditions that there is one copy of F . Our proofs use the hypergraph removal Lemma and stability results for the cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90427-4